Improved Parallel Rabin-Karp Algorithm Using Compute Unified Device Architecture

String matching algorithms are among one of the most widely used algorithms in computer science. Traditional string matching algorithms efficiency of underlaying string matching algorithm will greatly increase the efficiency of any application. In recent years, Graphics processing units are emerged as highly parallel processor. They out perform best of the central processing units in scientific computation power. By combining recent advancement in graphics processing units with string matching algorithms will allows to speed up process of string matching. In this paper we proposed modified parallel version of Rabin-Karp algorithm using graphics processing unit. Based on that, result of CPU as well as parallel GPU implementations are compared for evaluating effect of varying number of threads, cores, file size as well as pattern size.Comment: Information and Communication Technology for Intelligent Systems (ICTIS 2017

Duel and sweep algorithm for order-preserving pattern matching

Given a text $T$ and a pattern $P$ over alphabet $\Sigma$, the classic exact matching problem searches for all occurrences of pattern $P$ in text $T$. Unlike exact matching problem, order-preserving pattern matching (OPPM) considers the relative order of elements, rather than their real values. In this paper, we propose an efficient algorithm for OPPM problem using the "duel-and-sweep" paradigm. Our algorithm runs in $O(n + m\log m)$ time in general and $O(n + m)$ time under an assumption that the characters in a string can be sorted in linear time with respect to the string size. We also perform experiments and show that our algorithm is faster that KMP-based algorithm. Last, we introduce the two-dimensional order preserved pattern matching and give a duel and sweep algorithm that runs in $O(n^2)$ time for duel stage and $O(n^2 m)$ time for sweeping time with $O(m^3)$ preprocessing time.Comment: 13 pages, 5 figure

Instantons and Killing spinors

We investigate instantons on manifolds with Killing spinors and their cones. Examples of manifolds with Killing spinors include nearly Kaehler 6-manifolds, nearly parallel G_2-manifolds in dimension 7, Sasaki-Einstein manifolds, and 3-Sasakian manifolds. We construct a connection on the tangent bundle over these manifolds which solves the instanton equation, and also show that the instanton equation implies the Yang-Mills equation, despite the presence of torsion. We then construct instantons on the cones over these manifolds, and lift them to solutions of heterotic supergravity. Amongst our solutions are new instantons on even-dimensional Euclidean spaces, as well as the well-known BPST, quaternionic and octonionic instantons.Comment: 40 pages, 2 figures v2: author email addresses and affiliations adde

Efficient Online Timed Pattern Matching by Automata-Based Skipping

The timed pattern matching problem is an actively studied topic because of its relevance in monitoring of real-time systems. There one is given a log $w$ and a specification $\mathcal{A}$ (given by a timed word and a timed automaton in this paper), and one wishes to return the set of intervals for which the log $w$, when restricted to the interval, satisfies the specification $\mathcal{A}$. In our previous work we presented an efficient timed pattern matching algorithm: it adopts a skipping mechanism inspired by the classic Boyer--Moore (BM) string matching algorithm. In this work we tackle the problem of online timed pattern matching, towards embedded applications where it is vital to process a vast amount of incoming data in a timely manner. Specifically, we start with the Franek-Jennings-Smyth (FJS) string matching algorithm---a recent variant of the BM algorithm---and extend it to timed pattern matching. Our experiments indicate the efficiency of our FJS-type algorithm in online and offline timed pattern matching

CLort: High Throughput and Low Energy Network Intrusion Detection on IoT Devices with Embedded GPUs

While IoT is becoming widespread, cyber security of its devices is still a limiting factor where recent attacks (e.g., the Mirai bot-net) underline the need for countermeasures. One commonly-used security mechanism is a Network Intrusion Detection System (NIDS), but the processing need of NIDS has been a significant bottleneck for large dedicated machines, and a show-stopper for resource-constrained IoT devices. However, the topologies of IoT are evolving, adding intermediate nodes between the weak devices on the edges and the powerful cloud in the center. Also, the hardware of the devices is maturing, with new CPU instruction sets, caches as well as co-processors. As an example, modern single board computers, such as the Odroid XU4, come with integrated Graphics Processing Units (GPUs) that support general purpose computing. Even though using all available hardware efficiently is still an open issue, it has the promise to run NIDS more efficiently.In this work we introduce CLort, an extension to the well-known NIDS Snort that a) is designed for IoT devices b) alleviates the burden of pattern matching for intrusion detection by offloading it to the GPU. We thoroughly explain how our design is used as part of the latest release of Snort and suggest various optimizations to enable processing on the GPU. We evaluate CLort in regards to throughput, packet drops in Snort, and power consumption using publicly available traffic traces.\ua0CLort achieves up to 52% faster processing throughput than its CPU counterpart. CLort can also analyze up to 12% more packets than its CPU counterpart when sniffing a network.\ua0Finally, the experimental evaluation shows that CLort consumes up to 32% less energy than the CPU counterpart, an important consideration for IoT devices

An efficient and extensible approach for compressing phylogenetic trees

Biologists require new algorithms to efficiently compress and store their large collections of phylogenetic trees. TreeZip is a novel method for compressing phylogenetic trees. Recently, we extended our TreeZip algorithm to support branch lengths and show how it can be used to extract sets of trees of interest quickly. The key advantage of TreeZip over standard compression methods like 7zip is its ability to interpret and compress tree collections semantically, making it immune to branch rotations and allowing key operations (such calculating a consensus tree) to be performed quickly and without a loss of space savings. On unweighted phylogenetic trees, TreeZip is able to compress Newick files in excess of 98%. On weighted phylogenetic trees, TreeZip is able to compress a Newick file by at least 73%. TreeZip can be combined with 7zip with little overhead, allowing space savings in excess of 99 % (unweighted) and 92%(weighted). Unlike TreeZip, 7zip is not immune to branch rotations, and performs worse as the level of variability in the Newick string representation increases. Finally, since the TreeZip compressed text (TRZ) file contains all the semantic information in a collection of trees, we can easily filter and decompress a subset of trees of interest (such as the set of unique trees), or build the resulting consensus tree in a matter of seconds. We also show the ease of which set operations can be performed on TRZ files, at speeds quicker than those performed on Newick or 7zip compressed Newick files, and without loss of space savings. TreeZip is an efficient approach for compressing large collections of phylogenetic trees. The semantic and compact nature of the TRZ file allow it to be operated upon directly and quickly, without a need to decompress the original Newick file. We believe that TreeZip will be vital for compressing and archiving trees in the biological community.

LiFtEr: Language to Encode Induction Heuristics for Isabelle/HOL

Proof assistants, such as Isabelle/HOL, offer tools to facilitate inductive theorem proving. Isabelle experts know how to use these tools effectively; however, there is a little tool support for transferring this expert knowledge to a wider user audience. To address this problem, we present our domain-specific language, LiFtEr. LiFtEr allows experienced Isabelle users to encode their induction heuristics in a style independent of any problem domain. LiFtEr's interpreter mechanically checks if a given application of induction tool matches the heuristics, thus automating the knowledge transfer loop.Comment: This is the pre-print of our paper of the same title accepted at APLAS2019 (https://doi.org/10.1007/978-3-030-34175-6_14). We updated the draft after fixing the errata found by Kenji Miyamot

On electrostatic and Casimir force measurements between conducting surfaces in a sphere-plane configuration

We report on measurements of forces acting between two conducting surfaces in a spherical-plane configuration in the 35 nm-1 micrometer separation range. The measurements are obtained by performing electrostatic calibrations followed by a residual analysis after subtracting the electrostatic-dependent component. We find in all runs optimal fitting of the calibrations for exponents smaller than the one predicted by electrostatics for an ideal sphere-plane geometry. We also find that the external bias potential necessary to minimize the electrostatic contribution depends on the sphere-plane distance. In spite of these anomalies, by implementing a parametrixation-dependent subtraction of the electrostatic contribution we have found evidence for short-distance attractive forces of magnitude comparable to the expected Casimir-Lifshitz force. We finally discuss the relevance of our findings in the more general context of Casimir-Lifshitz force measurements, with particular regard to the critical issues of the electrical and geometrical characterization of the involved surfaces.Comment: 22 pages, 15 figure

Utilization of a deoxynucleoside diphosphate substrate by HIV reverse transcriptase

Background: Deoxynucleoside triphosphates (dNTPs) are the normal substrates for DNA sysnthesis is catalyzed by polymerases such as HIV-1 reverse transcriptase (RT). However, substantial amounts of deoxynucleoside diphosphates (dNDPs) are also present in the cell. Use of dNDPs in HIV-1 DNA sysnthesis could have significant implications for the efficacy of nucleoside RT inhibitors such as AZT which are first line therapeutics fro treatment of HIV infection. Our earlier work on HIV-1 reverse transcriptase (RT) suggested that the interaction between the γ phosphate of the incoming dNTP and RT residue K65 in the active site is not essential for dNTP insertion, implying that this polymerase may be able to insert dNPs in addition to dNTPs. Methodology/Principal Findings: We examined the ability of recombinant wild type (wt) and mutant RTs with substitutions at residue K65 to utilize a dNDP substrate in primer extension reactions. We found that wild type HIV-1 RT indeed catalyzes incorporation of dNDP substrates whereas RT with mutations of residue K645 were unable to catalyze this reaction. Wild type HIV-1 RT also catalyzed the reverse reaction, inorganic phosphate-dependent phosphorolysis. Nucleotide-mediated phosphorolytic removal of chain-terminating 3′-terminal nucleoside inhibitors such as AZT forms the basis of HIV-1 resistance to such drugs, and this removal is enhanced by thymidine analog mutations (TAMs). We found that both wt and TAM-containing RTs were able to catalyze Pi-mediated phosphorolysis of 3′-terminal AZT at physiological levels of Pi with an efficacy similar to that for ATP-dependent AZT-excision. Conclusion: We have identified two new catalytic function of HIV-1 RT, the use of dNDPs as substrates for DNA synthesis, and the use of Pi as substrate for phosphorolytic removal of primer 3′-terminal nucleotides. The ability to insert dNDPs has been documented for only one other DNA polymerase The RB69 DNA polymerase and the reverse reaction employing inorganic phosphate has not been documented for any DNA polymerase. Importantly, our results show that Pi-mediated phosphorolysis can contribute to AZT resistance and indicates that factors that influence HIV resistance to AZT are more complex than previously appreciated. © 2008 Garforth et al